An Algorithm for Finding a Non-Trivial Lower Bound for Channel Routing
نویسندگان
چکیده
Channel routing is a key problem in the physical design of VLSI chips. It is known that ma4dmz, urn,,) is a lower bound on the number of tmcka requared in the reserved two-layer Manhattan routine model. where d,,,,, is the channel density and vi, is the length oftKe longest path in the vertical constraint omvh. In this paver we vropose a polynomial time algorithm that ‘wmput’es a better and non-trivial lower bound on the number df o tracks required for routing a channel without oglcgging. This algorithm is also applicable for computing a lower bound on the number of tracks in the three-layer no-dogleg HVH routing as well as twoand three-layer restricted dogleg routing models.
منابع مشابه
Two phase genetic algorithm for vehicle routing and scheduling problem with cross-docking and time windows considering customer satisfaction
Cross-docking is a new warehousing policy in logistics which is widely used all over the world and attracts many researchers attention to study about in last decade. In the literature, economic aspects has been often studied, while one of the most significant factors for being successful in the competitive global market is improving quality of customer servicing and focusing on customer satisfa...
متن کاملحل ابتکاری و کران پایین برای مسئله مکانیابی-مسیریابی دو ردهای
During the last three decades, the integrated optimization approach to logistics systems has become one of the most important aspects of the supply chain optimization. This approach simultaneously considers the interdependence of the location of the facilities, suppliers/customers allocation to the facilities, the structure of transportation routes, and inventory planning and control. Location...
متن کاملInterference-Aware and Cluster Based Multicast Routing in Multi-Radio Multi-Channel Wireless Mesh Networks
Multicast routing is one of the most important services in Multi Radio Multi Channel (MRMC) Wireless Mesh Networks (WMN). Multicast routing performance in WMNs could be improved by choosing the best routes and the routes that have minimum interference to reach multicast receivers. In this paper we want to address the multicast routing problem for a given channel assignment in WMNs. The channels...
متن کاملAn efficient lower bound algorithm for channel routing
Channel routing plays a central role in the physical design of VLSI chips. For two-layer dogleg-free channel routing, dm,, and v,, are the two traditional lower bounds. In this paper, we present two efficient algorithms for computing a tighter lower bound for the channel routing problem. Our algorithms succe:j~fully compute a lower bound of 26 for Deutsch's Difficult Example (DDE). The experime...
متن کاملAnalysis of a Dominant Retailer Dual-Channel Supply Chain under Customers’ Channel Preference: The α-Branch and Bound Solution Algorithm
This paper investigates the Stackelberg equilibrium for pricing and ordering decisions in a dominant retailer dual-channel supply chain. In a dual-channel sales network, the products are sold through both a traditional, physical retailer and a direct Internet channel. It is assumed that the retailer is the leader and the powerful member of the supply chain has the market power and acts as a lea...
متن کامل